Early credit return for credit-based flow control

ABSTRACT

A device allocates buffer space for storing data received from another device. The other device has a credit balance corresponding to the amount of buffer space. A sending device reduces its number of credits by a cost of a packet and sends the packet. To ensure that the buffer does not overflow, the sending device spends a credit for each entry in the buffer that could be consumed by the sent data packet. When received data is added to the buffer without consuming a new entry, a response packet that returns a credit is sent to the sending device before the data is read from the buffer. Thus, the sending device is enabled to continue sending data without waiting for the buffer to be read, enabling the communication between the two devices to make more efficient use of the buffer.

STATEMENT REGARDING GOVERNMENT SUPPORT

This invention was made with U.S. Government support under Agreement No. HR00111830003, awarded by DARPA. The U.S. Government has certain rights in the invention.

TECHNICAL FIELD

Embodiments of the disclosure relate generally to managing packet-based network communications using credit-based flow control in which flow control is managed by credits and “credit returns.” and more specifically, to early credit return in a system using credit-based flow control, which in selected embodiments may be implemented in packet-based communications in a chiplet system.

BACKGROUND

A sending device using a credit-based flow control system reduces its available credits before sending data to a receiving device. The receiving device buffers the data. In a conventional credit-based system, after the data is removed from the buffer and processed, the receiving device sends a responsive message to the sending device. In response to receiving the responsive message, the sending device increases its available credits.

Chiplets are an emerging technique for integrating various processing functionalities. Generally, a chiplet system is made up of discrete modules (each a “chiplet”) that are integrated on an interposer, and in many examples interconnected as desired through one or more established networks, to provide a system with the desired functionality. The interposer and included chiplets may be packaged together to facilitate interconnection with other components of a larger system. Each chiplet may include one or more individual integrated circuits, or “chips” (ICs), potentially in combination with discrete circuit components, and commonly coupled to a respective substrate to facilitate attachment to the interposer. Most or all chiplets in a system will be individually configured for communication through the one or more established networks.

The configuration of chiplets as individual modules of a system is distinct from such a system being implemented on single chips that contain distinct device blocks (e.g., intellectual property (IP) blocks) on one substrate (e.g., single die), such as a system-on-a-chip (SoC), or multiple discrete packaged devices integrated on a printed circuit board (PCB). In general, chiplets provide better performance (e.g., lower power consumption, reduced latency, etc.) than discrete packaged devices, and chiplets provide greater production benefits than single die chips. These production benefits can include higher yields or reduced development costs and time.

Chiplet systems may include, for example, one or more application (or processor) chiplets and one or more support chiplets. Here, the distinction between application and support chiplets is simply a reference to the likely design scenarios for the chiplet system. Thus, for example, a synthetic vision chiplet system can include, by way of example only, an application chiplet to produce the synthetic vision output along with support chiplets, such as a memory controller chiplet, a sensor interface chiplet, or a communication chiplet. In a typical use case, the synthetic vision designer can design the application chiplet and source the support chiplets from other parties. Thus, the design expenditure (e.g., in terms of time or complexity) is reduced because by avoiding the design and production of functionality embodied in the support chiplets. Chiplets also support the tight integration of IP blocks that can otherwise be difficult, such as those manufactured using different processing technologies or using different feature sizes (or utilizing different contact technologies or spacings). Thus, multiple IC's or IC assemblies, with different physical, electrical, or communication characteristics may be assembled in a modular manner to provide an assembly providing desired functionalities. Chiplet systems can also facilitate adaptation to suit needs of different larger systems into which the chiplet system will be incorporated. In an example, IC's or other assemblies can be optimized for the power, speed, or heat generation for a specific function—as can happen with sensors—can be integrated with other devices more easily than attempting to do so on a single die. Additionally, by reducing the overall size of the die, the yield for chiplets tends to be higher than that of more complex, single die devices.

BRIEF DESCRIPTION OF THE DRAWINGS

The disclosure will be understood more fully from the detailed description given below and from the accompanying drawings of various embodiments of the disclosure. The drawings, however, should not be taken to limit the disclosure to the specific embodiments, but are for explanation and understanding only.

FIGS. 1A and 1B illustrate an example of a chiplet system, according to an embodiment.

FIG. 2 illustrates components of an example of a memory controller chiplet, according to an embodiment.

FIG. 3 illustrates an example of routing between chiplets in a chiplet layout using a chiplet protocol interface (CPI) network, according to an embodiment.

FIG. 4 is a block diagram of a packet buffer that uses credit-based flow control and a packet command buffer suitable for use in early credit return in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

FIG. 5 is a block diagram of a data packet suitable for use in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

FIG. 6 is a block diagram of a data packet suitable for early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

FIG. 7 is a flow chart showing operations of a method performed by two circuits in performing early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

FIG. 8 is a flow chart showing operations of a method performed by two circuits in performing early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

FIG. 9 is a flow chart showing operations of a method performed by a circuit in performing early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

FIG. 10 is a block diagram of an example computer system in which embodiments of the present disclosure may operate.

DETAILED DESCRIPTION

FIG. 1, described below, offers an example of a chiplet system and the components operating therein. Within the context of such a chiplet system, flow control may be managed by “credits” and “credit returns.” In such a system, when communication between two devices is initiated, one or both of the devices allocates buffer space for storing data received from the other device; and the amount of allocated buffer space (in terms of credits) is communicated to the other device, as discussed in more detail below. In described implementations herein implementing a credit/credit return system, a device receiving a packet containing a command issues a credit return to the source “early” potentially before the received packet has been read by the receiving device. In one example, a credit return may be issued on storage of the first command in a buffer. Credit-based flow control may be used to prevent buffer overloading in a network with bursty traffic. Credit-based flow control may be used among chiplets in a chip, among chips in a device, among devices in a local or wide area network, or any suitable combination thereof.

An example system making use of the described credit return mechanism is a modular memory system, in which discrete modules containing one or more semiconductor devices or other components providing respective functionality of the memory system (each module termed a “chiplet”), are assembled, and interconnected through one or more communication interfaces, to provide the memory system functionality. A chiplet-based system, for example the identified modular memory system provides substantial advantages in allowing beneficial modifications to one portion of the system without requiring redesign of the entire memory system, or components thereof. Examples of such beneficial modifications may include, for example, adding additional storage capacity; adding memory based on a different storage technology (and potentially requiring a specialized interface or control functionality); adapting to modifications of a memory controller or memory communication bus; etc.).

In some examples of such a chiplet-based system, communications between individual chiplets may be managed locally, between individual chiplets.

When communication between two devices is initiated, one or both of the devices allocates buffer space for storing data received from the other device. The allocating device informs the other device of the amount of buffer space allocated by sending a data packet indicating a number of credits available. In some example embodiments, the sending of the data packet indicating the number of credits is skipped and a predetermined number of credits is self-allocated.

Before sending a packet, the sending device confirms that sufficient credit is available. If sufficient credit is available, the number of credits is reduced by a cost of the packet (e.g., one credit) and the packet is sent. In some example embodiments, the cost of the packet is based on the size of the packet.

The receiving device stores at least a portion of the data packet in the buffer. For example, the data packet may contain a 32-bit field that contains one to four command bytes, as indicated by a four-bit mask field. The active command bytes are copied to the buffer and the inactive command bytes are discarded. Thus, if each entry in the buffer stores four bytes, one 32-bit field will always consume no more than one entry, but may consume as little as one-fourth of an entry.

To ensure that the buffer does not overflow, the sending device spends a credit for each entry in the buffer that could be consumed by the sent data packet. Thus, even if the sent data packet only contains one byte of data, credit for an entire entry is spent. However, the receiving device may be able to store the received data entirely in an already-allocated entry. For example, a first data packet includes three bytes of data and a second data packet includes one byte of data. In this example, the data from both packets may be stored in a single entry, but the sending device would reduce the available credits by two.

In existing systems, the credits are returned by the receiving device after the data is read from the buffer. As discussed herein, when received data is added to the buffer without consuming a new entry, a response packet is sent to the sending device before the data is read from the buffer. The response packet returns a credit to the sending device. Thus, the sending device is enabled to continue sending data without waiting for the buffer to be read, enabling the communication between the two devices to make more efficient use of the buffer.

Among the benefits that may result from selected implementations of the present disclosure is that a sending device spends less time in a state wherein the sending of packets is halted. As a result, processing cycles expended in a wait state and rechecking of the number of available credits are reduced. Additionally, power consumed in the wait state is reduced. Performance of the system comprising the communicating devices is also improved as a result of the reduced delay in data transmission. This efficiency in communication may provide particular benefits when applied to communications to and/or from a memory device and/or memory controller, as waiting time of one or more processors or processor cores while awaiting results of memory reads, for example, can also impact multiple aspects of system performance. Other benefits will be evident to those of skill in the relevant art having the benefit of this disclosure.

FIGS. 1A and 1B illustrate an example of a chiplet system 110, according to an embodiment. FIG. 1A is a representation of the chiplet system 110 mounted on a peripheral board 105, that can be connected to a broader computer system by a peripheral component interconnect express (PCIe), for example. The chiplet system 110 includes a package substrate 115, an interposer 120, and four chiplets, an application chiplet 125, a host interface chiplet 135, a memory controller chiplet 140, and a memory device chiplet 150. Other systems may include many additional chiplets to provide additional functionalities as will be apparent from the following discussion. The package of the chiplet system 110 is illustrated with a lid or cover 165, though other packaging techniques and structures for the chiplet system can be used. FIG. 1B is a block diagram labeling the components in the chiplet system for clarity.

The application chiplet 125 is illustrated as including a network-on-chip (NOC) 130 to support a chiplet network 155 for inter-chiplet communications. In example embodiments NOC 130 may be included on the application chiplet 125. In an example, NOC 130 may be defined in response to selected support chiplets (e.g., chiplets 135, 140, and 150) thus enabling a designer to select an appropriate number or chiplet network connections or switches for the NOC 130. In an example, the NOC 130 can be located on a separate chiplet, or even within the interposer 120. In examples as discussed herein, the NOC 130 implements a chiplet protocol interface (CPI) network.

The CPI is a packet-based network that supports virtual channels to enable a flexible and high-speed interaction between chiplets. CPI enables bridging from intra-chiplet networks to the chiplet network 155. For example, the Advanced eXtensible Interface (AXI) is a widely used specification to design intra-chip communications. AXI specifications, however, cover a great variety of physical design options, such as the number of physical channels, signal timing, power, etc. Within a single chip, these options are generally selected to meet design goals, such as power consumption, speed, etc. However, to achieve the flexibility of the chiplet system, an adapter, such as CPI, is used to interface between the various AXI design options that can be implemented in the various chiplets. By enabling a physical channel to virtual channel mapping and encapsulating time-based signaling with a packetized protocol. CPI bridges intra-chiplet networks across the chiplet network 155.

CPI can use a variety of different physical layers to transmit packets. The physical layer can include simple conductive connections, or can include drivers to increase the voltage, or otherwise facilitate transmitting the signals over longer distances. An example of one such physical layer can include the Advanced Interface Bus (AIB), which in various examples, can be implemented in the interposer 120. AIB transmits and receives data using source synchronous data transfers with a forwarded clock. Packets are transferred across the AIB at single data rate (SDR) or double data rate (DDR) with respect to the transmitted clock. Various channel widths are supported by AIB. AIB channel widths are in multiples of 20 bits when operated in SDR mode (20, 40, 60, . . . ), and multiples of 40 bits for DDR mode: (40, 80, 120, . . . ). The AIB channel width includes both transmit and receive signals. The channel can be configured to have a symmetrical number of transmit (TX) and receive (RX) input/outputs (I/Os), or have a non-symmetrical number of transmitters and receivers (e.g., either all transmitters or all receivers). The channel can act as an AIB master or slave depending on which chiplet provides the master clock. AIB I/O cells support three clocking modes: asynchronous (i.e. non-clocked), SDR, and DDR. In various examples, the non-clocked mode is used for clocks and some control signals. The SDR mode can use dedicated SDR only I/O cells, or dual use SDR/DDR I/O cells.

In an example, CPI packet protocols (e.g., point-to-point or routable) can use symmetrical receive and transmit I/O cells within an AIB channel. The CPI streaming protocol allows more flexible use of the AIB I/O cells. In an example, an AIB channel for streaming mode can configure the I/O cells as all TX, all RX, or half TX and half RX. CPI packet protocols can use an AIB channel in either SDR or DDR operation modes. In an example, the AIB channel is configured in increments of 80 I/O cells (i.e. 40 TX and 40 RX) for SDR mode and 40 I/O cells for DDR mode. The CPI streaming protocol can use an AIB channel in either SDR or DDR operation modes. Here, in an example, the AIB channel is in increments of 40 I/O cells for both SDR and DDR modes. In an example, each AIB channel is assigned a unique interface identifier. The identifier is used during CPI reset and initialization to determine paired AIB channels across adjacent chiplets. In an example, the interface identifier is a 20-bit value comprising a seven-bit chiplet identifier, a seven-bit column identifier, and a six-bit link identifier. The AIB physical layer transmits the interface identifier using an AIB out-of-band shift register. The 20-bit interface identifier is transferred in both directions across an AIB interface using bits 32-51 of the shift registers.

AIR defines a stacked set of AIB channels as an AIB channel column. An AIR channel column has some number of AIB channels, plus an auxiliary channel. The auxiliary channel contains signals used for AIB initialization. All AIR channels (other than the auxiliary channel) within a column are of the same configuration (e.g., all TX, all RX, or half TX and half RX, as well as having the same number of data I/O signals). In an example, AIB channels are numbered in continuous increasing order starting with the AIB channel adjacent to the AUX channel. The AIB channel adjacent to the AUX is defined to be AIB channel zero.

AIB channels are typically configured as half TX data plus half RX data, all TX data, or all RX data plus associated clocks and miscellaneous control. The number of TX versus RX data signals is determined at design time and cannot be configured as part of system initialization, in some example embodiments.

The CPI packet protocols (point-to-point and routable) use symmetrical receive and transmit I/O cells within an AIB channel. The CPI streaming protocol allows more flexible use of the AMB I/O cells. An AIB channel for streaming mode may configure the I/O cells as all TX, all RX, or half TX and half RX, in some example embodiments.

Generally. CPI interfaces on individual chiplets can include serialization-deserialization (SERDES) hardware. SERDES interconnects work well for scenarios in which high-speed signaling with low signal count are desirable. SERDES, however, can result in additional power consumption and longer latencies for multiplexing and demultiplexing, error detection or correction (e.g., using block level cyclic redundancy checking (CRC)), link-level retry, or forward error correction. However, when low latency or energy consumption is a primary concern for ultra-short reach, chiplet-to-chiplet interconnects, a parallel interface with clock rates that allow data transfer with minimal latency may be utilized. CPI includes elements to minimize both latency and energy consumption in these ultra-short reach chiplet interconnects.

For flow control. CPI employs a credit-based technique. A recipient, such as the application chiplet 125, provides a sender, such as the memory controller chiplet 140, with credits that represent available buffers. In an example, a CPI recipient includes a buffer for each virtual channel for a given time-unit of transmission. Thus, if the CPI recipient supports five messages in time and a single virtual channel, the recipient has five buffers arranged in five entries (e.g., one entry for each unit time). If four virtual channels are supported, then the recipient has twenty buffers arranged in five entries. Each buffer holds the payload of one CPI packet.

When the sender transmits to the recipient, the sender decrements the available credits based on the transmission. Once all credits for the recipient are consumed, the sender stops sending packets to the recipient. This ensures that the recipient always has an available buffer to store the transmission.

As the recipient processes received packets and frees buffers, the recipient communicates the available buffer space back to the sender. This credit return that indicates buffer space available for the sender can then be used by the sender allow transmitting of additional information.

Also illustrated is a chiplet mesh network 160 that uses a direct, chiplet-to-chiplet technique without the need for the NOC 130. The chiplet mesh network 160 can be implemented in CPI, or another chiplet-to-chiplet protocol. The chiplet mesh network 160 generally enables a pipeline of chiplets where one chiplet serves as the interface to the pipeline while other chiplets in the pipeline interface only with themselves.

Additionally, dedicated device interfaces, such as one or more industry standard memory interfaces 145 (such as, for example, synchronous memory interfaces, such as DDR5, DDR 6), can also be used to interconnect chiplets. Connection of a chiplet system or individual chiplets to external devices (such as a larger system can be through a desired interface (for example, a PCIE interface). Such as external interface may be implemented, in an example, through a host interface chiplet 135, which in the depicted example, provides a PCIE interface external to chiplet system 110. Such dedicated interfaces 145 are generally employed when a convention or standard in the industry has converged on such an interface. The illustrated example of a DDR interface 145 connecting the memory controller chiplet 140 to a dynamic random access memory (DRAM) memory device 150 is just such an industry convention.

Of the variety of possible support chiplets, the memory controller chiplet 140 is likely present in the chiplet system 110 due to the near omnipresent use of storage for computer processing as well as sophisticated state-of-the-art for memory devices. Thus, using memory device chiplets 150 and memory controller chiplets 140 produced by others gives chiplet system designers access to robust products by sophisticated producers. Generally, the memory controller chiplet 140 provides a memory device specific interface to read, write, or erase data. Often, the memory controller chiplet 140 can provide additional features, such as error detection, error correction, maintenance operations, or atomic operation execution. For some types of memory, maintenance operations tend to be specific to the memory device 150, such as garbage collection in NAND flash or storage class memories, temperature adjustments (e.g., cross temperature management) in NAND flash memories. In an example, the maintenance operations can include logical-to-physical (L2P) mapping or management to provide a level of indirection between the physical and logical representation of data. In other types of memory, for example DRAM, some memory operations, such as refresh may be controlled by a host processor or of a memory controller at some times, and at other times controlled by the DRAM memory device, or by logic associated with one or more DRAM devices, such as an interface chip (in an example, a buffer).

Atomic operations are a data manipulation that, for example, may be performed by the memory controller chiplet 140. In other chiplet systems, the atomic operations may be performed by other chiplets. For example, an atomic operation of “increment” can be specified in a command by the application chiplet 125, the command including a memory address and possibly an increment value. Upon receiving the command, the memory controller chiplet 140 retrieves a number from the specified memory address, increments the number by the amount specified in the command, and stores the result. Upon a successful completion, the memory controller chiplet 140 provides an indication of the commands success to the application chiplet 125. Atomic operations avoid transmitting the data across the chiplet network 160, resulting in lower latency execution of such commands.

Atomic operations can be classified as built-in atomics or programmable (e.g., custom) atomics. Built-in atomics are a finite set of operations that are immutably implemented in hardware. Programmable atomics are small programs that can run on a programmable atomic unit (PAU) (e.g., a custom atomic unit (CAU)) of the memory controller chiplet 140. FIG. 1 illustrates an example of a memory controller chiplet that discusses a PAU.

The memory device chiplet 150 can be, or include any combination of, volatile memory devices or non-volatile memories. Examples of volatile memory devices include, but are not limited to, random access memory (RAM)—such as DRAM) synchronous DRAM (SDRAM), graphics DDR type 6 SDRAM (GDDR6 SDRAM), among others. Examples of non-volatile memory devices include, but are not limited to, negative-and-(NAND)-type flash memory, storage class memory (e.g., phase-change memory or memristor based technologies), ferroelectric RAM (FeRAM), among others. The illustrated example includes the memory device 150 as a chiplet, however, the memory device 150 can reside elsewhere, such as in a different package on the board 105. For many applications, multiple memory device chiplets may be provided. In an example, these memory device chiplets may each implement one or multiple storage technologies. In an example, a memory chiplet may include, multiple stacked memory die of different technologies, for example one or more SRAM devices stacked or otherwise in communication with one or more DRAM devices. Memory controller 140 may also serve to coordinate operations between multiple memory chiplets in chiplet system 110; for example, to utilize one or more memory chiplets in one or more levels of cache storage, and to use one or more additional memory chiplets as main memory. Chiplet system 110 may also include multiple memory controllers 140, as may be used to provide memory control functionality for separate processors, sensors, networks, etc. A chiplet architecture, such as chiplet system 110 offers advantages in allowing adaptation to different memory storage technologies; and different memory interfaces, through updated chiplet configurations, without requiring redesign of the remainder of the system structure.

FIG. 2 illustrates components of an example of a memory controller chiplet 205, according to an embodiment. The memory controller chiplet 205 includes a cache 210, a cache controller 215, an off-die memory controller 220 (e.g., to communicate with off-die memory 175), a network communication interface 225 (e.g., to interface with a chiplet network 180 and communicate with other chiplets), and a set of atomic and merge operations 250. Members of this set can include, for example, a write merge unit 155, a hazard unit (160), built-in atomic unit 165, or a PAU 170. The various components are illustrated logically, and not as they necessarily would be implemented. For example, the built-in atomic unit 165 likely comprises different devices along a path to the off-die memory. For example, the built-in atomic unit could be in an interface device/buffer on a memory chiplet, as discussed above. In contrast, the programmable atomic operations 170 are likely implemented in a separate processor on the memory controller chiplet 105 (but in various examples may be implemented in other locations, for example on a memory chiplet).

The off-die memory controller 220 is directly coupled to the off-die memory 275 (e.g., via a bus or other communication connection) to provide write operations and read operations to and from the one or more off-die memory, such as off-die memory 275 and off-die memory 280. In the depicted example, the off-die memory controller 220 is also coupled for output to the atomic and merge operations unit 250, and for input to the cache controller 215 (e.g., a memory side cache controller).

In the example configuration, cache controller 215 is directly coupled to the cache 210, and may be coupled to the network communication interface 225 for input (such as incoming read or write requests), and coupled for output to the off-die memory controller 220.

The network communication interface 225 includes a packet decoder 230, network input queues 235, a packet encoder 240, and network output queues 245 to support a packet-based chiplet network 285, such as CPI. The chiplet network 285 can provide packet routing between and among processors, memory controllers, hybrid threading processors, configurable processing circuits, or communication interfaces. In such a packet-based communication system, each packet typically includes destination and source addressing, along with any data payload or instruction. In an example, the chiplet network 285 can be implemented as a collection of crossbar switches having a folded Clos configuration, or a mesh network providing for additional connections, depending upon the configuration.

In various examples, the chiplet network 285 can be part of an asynchronous switching fabric. Here, a data packet can be routed along any of various paths, such that the arrival of any selected data packet at an addressed destination can occur at any of multiple different times, depending upon the routing. Additionally, chiplet network 285 can be implemented at least in part as a synchronous communication network, such as a synchronous mesh communication network. Both configurations of communication networks are contemplated for use for examples in accordance with the present disclosure.

The memory controller chiplet 205 can receive a packet having, for example, a source address, a read request, and a physical address. In response, the off-die memory controller 220 or the cache controller 215 will read the data from the specified physical address (which can be in the off-die memory 275 or in the cache 210), and assemble a response packet to the source address containing the requested data. Similarly, the memory controller chiplet 205 can receive a packet having a source address, a write request, and a physical address. In response, the memory controller chiplet 205 will write the data to the specified physical address (which can be in the cache 210 or in the off-die memories 275 or 280), and assemble a response packet to the source address containing an acknowledgement that the data was stored to a memory.

Thus, the memory controller chiplet 205 can receive read and write requests via the chiplet network 285 and process the requests using the cache controller 215 interfacing with the cache 210, if possible. If the request cannot be handled by the cache controller 215, the off-die memory controller 220 handles the request by communication with the off-die memories 275 or 280, the atomic and merge operations 250, or both. As noted above, one or more levels of cache may also be implemented in off-die memories 275 or 280; and in some such examples may be accessed directly by cache controller 215. Data read by the off-die memory controller 220 can be cached in the cache 210 by the cache controller 215 for later use.

The atomic and merge operations 250 are coupled to receive (as input) the output of the off-die memory controller 220, and to provide output to the cache 210, the network communication interface 225, or directly to the chiplet network 285. The memory hazard clear (reset) unit 260, write merge unit 265 and the built-in (e.g., predetermined) atomic operations unit 265 can each be implemented as state machines with other combinational logic circuitry (such as adders, shifters, comparators, AND gates, OR gates, XOR gates, or any suitable combination thereof) or other logic circuitry. These components can also include one or more registers or buffers to store operand or other data. The PAU 270 can be implemented as one or more processor cores or control circuitry, and various state machines with other combinational logic circuitry or other logic circuitry, and can also include one or more registers, buffers, or memories to store addresses, executable instructions, operand and other data, or can be implemented as a processor.

The write merge unit 255 receives read data and request data, and merges the request data and read data to create a single unit having the read data and the source address to be used in the response or return data packet). The write merge unit 255 provides the merged data to the write port of the cache 210 (or, equivalently, to the cache controller 215 to write to the cache 210). Optionally, the write merge unit 255 provides the merged data to the network communication interface 225 to encode and prepare a response or return data packet for transmission on the chiplet network 280.

When the request data is for a built-in atomic operation, the built-in atomic operations unit 265 receives the request and reads data, either from the write merge unit 265 or directly from the off-die memory controller 220. The atomic operation is performed, and using the write merge unit 255, the resulting data is written to the cache 210, or provided to the network communication interface 225 to encode and prepare a response or return data packet for transmission on the chiplet network 285.

The built-in atomic operations unit 265 handles predefined atomic operations such as fetch-and-increment or compare-and-swap. In an example, these operations perform a simple read-modify-write operation to a single memory location of 32-bytes or less in size. Atomic memory operations are initiated from a request packet transmitted over the chiplet network 285. The request packet has a physical address, atomic operator type, operand size, and optionally up to 32-bytes of data. The atomic operation performs the read-modify-write to a cache memory line of the cache 210, filling the cache memory if necessary. The atomic operator response can be a simple completion response, or a response with up to 32-bytes of data. Example atomic memory operators include fetch-and-AND, fetch-and-OR, fetch-and-XOR, fetch-and-add, fetch-and-subtract, fetch-and-increment, fetch-and-decrement, fetch-and-minimum, fetch-and-maximum, fetch-and-swap, and compare-and-swap. In various example embodiments, 32-bit and 64-bit operations are supported, along with operations on 16 or 32 bytes of data. Methods disclosed herein are also compatible with hardware supporting larger or smaller operations and more or less data.

Built-in atomic operations can also involve requests for a “standard” atomic operation on the requested data, such as comparatively simple, single cycle, integer atomics-such as fetch-and-increment or compare-and-swap-which will occur with the same throughput as a regular memory read or write operation not involving an atomic operation. For these operations, the cache controller 215 may generally reserve a cache line in the cache 210 by setting a hazard bit (in hardware), so that the cache line cannot be read by another process while it is in transition. The data is obtained from either the off-die memory 275 or the cache 210, and is provided to the built-in atomic operation unit 265 to perform the requested atomic operation. Following the atomic operation, in addition to providing the resulting data to the data packet encoder 240 to encode outgoing data packets for transmission on the chiplet network 285, the built-in atomic operation unit 265 provides the resulting data to the write merge unit 255, which will also write the resulting data to the cache circuit 210. Following the writing of the resulting data to the cache 210, any corresponding hazard bit which was set will be cleared by the memory hazard clear unit 260.

The PAU 270 enables high performance (high throughput and low latency) for programmable atomic operations (also referred to as “custom atomic operations”), comparable to the performance of built-in atomic operations. Rather than executing multiple memory accesses, in response to an atomic operation request designating a programmable atomic operation and a memory address, circuitry in the memory controller chiplet 205 transfers the atomic operation request to PAU 270 and sets a hazard bit stored in a memory hazard register corresponding to the memory address of the memory line used in the atomic operation, to ensure that no other operation (read, write, or atomic) is performed on that memory line, which hazard bit is then cleared upon completion of the atomic operation. Additional, direct data paths provided for the PAU 270 executing the programmable atomic operations allow for additional write operations without any limitations imposed by the bandwidth of the communication networks and without increasing any congestion of the communication networks.

The PAU 270 includes a multi-threaded processor, for example, such as a RISC-V ISA based multi-threaded processor, having one or more processor cores, and further having an extended instruction set for executing programmable atomic operations. When provided with the extended instruction set for executing programmable atomic operations, the PAU 270 can be embodied as one or more hybrid threading processors. In some example embodiments, the PAU 270 provides barrel-style, round-robin instantaneous thread switching to maintain a high instruction-per-clock rate.

Programmable atomic operations can be performed by the PAU 270 involving requests for a programmable atomic operation on the requested data. A user can prepare programming code to provide such programmable atomic operations. For example, the programmable atomic operations can be comparatively simple, multi-cycle operations such as floating-point addition, or comparatively complex, multi-instruction operations such as a Bloom filter insert. The programmable atomic operations can be the same as or different than the predetermined atomic operations, insofar as they are defined by the user rather than a system vendor. For these operations, the cache controller 215 can reserve a cache line in the cache 210, by setting a hazard bit (in hardware), so that cache line cannot be read by another process while it is in transition. The data is obtained from either the cache 210 or the off-die memories 275 or 280, and is provided to the PAU 270 to perform the requested programmable atomic operation. Following the atomic operation, the PAU 270 will provide the resulting data to the network communication interface 225 to directly encode outgoing data packets having the resulting data for transmission on the chiplet network 285. In addition, the PAU 270 will provide the resulting data to the cache controller 215, which will also write the resulting data to the cache 210. Following the writing of the resulting data to the cache 210, any corresponding hazard bit which was set will be cleared by the cache control circuit 215.

In selected examples, the approach taken for programmable atomic operations is to provide multiple, generic, custom atomic request types that can be sent through the chiplet network 285 to the memory controller chiplet 205 from an originating source such as a processor or other system component. The cache controllers 215 or off-die memory controller 220 identify the request as a custom atomic and forward the request to the PAU 270. In a representative embodiment, the PAU 270: (1) is a programmable processing element capable of efficiently performing a user defined atomic operation; (2) can perform load and stores to memory, arithmetic and logical operations and control flow decisions; and (3) leverages the RISC-V ISA with a set of new, specialized instructions to facilitate interacting with such controllers 215, 220 to atomically perform the user-defined operation. In desirable examples, the RISC-V ISA contains a full set of instructions that support high level language operators and data types. The PAU 270 can leverage the RISC-V ISA, but will commonly support a more limited set of instructions and limited register file size to reduce the die size of the unit when included within the memory controller chiplet 205.

As mentioned above, prior to the writing of the read data to the cache 210, the set hazard bit for the reserved cache line is to be cleared, by the memory hazard clear unit 260. Accordingly, when the request and read data is received by the write merge unit 255, a reset or clear signal can be transmitted by the memory hazard clear unit 260 to the cache 210 to reset the set memory hazard bit for the reserved cache line. Also, resetting this hazard bit will also release a pending read or write request involving the designated (or reserved) cache line, providing the pending read or write request to an inbound request multiplexer for selection and processing.

FIG. 3 illustrates an example of routing between chiplets in a chiplet layout 300 using a chiplet protocol interface (CPI) network, according to an embodiment. The chiplet layout 300 includes chiplets 310A, 310B, 310C, 310D, 310E, 310F, 310G, and 310H. The chiplets 310A-310H are interconnected by a network comprising nodes 330A, 330B, 330C, 330D, 330E, 330F, 330G, and 330H. Each of the chiplets 310A-310H includes a hardware transceiver, labeled 320A-320H.

CPI packets can be transferred between the chiplets 310 using an Advanced Interface Bus (AIB). The AIB provides physical layer functionality. The physical layer transmits and receives data using source synchronous data transfers with a forwarded clock. Packets are transferred across the AIB at SDR or DDR with respect to the transmitted clock. Various channel widths are supported by the AIB. AIB channel widths are in multiples of 20 bits when operated in SDR mode (20, 40, 60, . . . ), and 40 bits for DDR mode: (40, 80, 120, . . . ). The AIB channel width includes both transmit and receive signals. The channel may be configured to have a symmetrical number of transmit (TX) and receive (RX) input/outputs (I/Os), or have a non-symmetrical number of transmitters and receivers (e.g., either all transmitters or all receivers). The channel may act as an AIB master or slave depending on which chiplet provides the master clock.

The AIB adapter provides an interface to the AIB link layer and an interface to the AIB physical layer (PHY). The AIB adapter provides data staging registers, power-on reset sequencers, and a control signal shift register.

The AIB physical layer consists of AIB I/O Cells. AIB I/O cells (implemented, in some example embodiments, by the hardware transceivers 320) may be input only, output only or bidirectional. An AIB channel is composed of a set of AIB I/O cells, the number of cells is dependent on the configuration of the AIB channel. The receive signals on one chiplet are connected to the transmit signals on the paired chiplet. In some example embodiments, each column comprises an auxiliary (AUX) channel and data channels numbered 0 to N.

Data packets are routed among the chiplets 310 by the network nodes 330. A node 330 may determine the next node 330 to forward a received data packet to based on one or more data fields of the data packet. For example, a source or destination address, source or destination port, virtual channel, or any suitable combination thereof may be hashed to select a successive network node or an available network path. Selecting paths in this way may serve to balance network traffic.

Thus, in FIG. 3, a data path is shown from the chiplet 310A to the chiplet 310D. The data packet is sent by the hardware transceiver 320A to the network node 330A; forwarded by the network node 330A to the network node 330C; forwarded by the network node 330C to the network node 330D; and delivered by the network node 330D to the hardware transceiver 320D of the chiplet 310D.

A second data path is also shown in FIG. 3, from the chiplet 310A to the chiplet 310G. The data packet is sent by the hardware transceiver 320A to the network node 330A; forwarded by the network node 330A to the network node 330B; forwarded by the network node 330B to the network node 330D; forwarded by the network node 330D to the network node 330C; forwarded by the network node 330C to the network node 330E; forwarded by the network node 330E to the network node 330F; forwarded by the network node 330F to the network node 330H; forwarded by the network node 330H to the network node 330G; and delivered by the network node 330G to the hardware transceiver 320G of the chiplet 310G. As is visually apparent in FIG. 3, multiple paths through the network are available for transmission of data between any pair of chiplets.

AIB I/O cells support three clocking modes: asynchronous (i.e. non-clocked). SDR, and DDR. The non-clocked mode is used for clocks and some control signals. The SDR mode may use dedicated SDR only I/O cells, or dual use SDR/DDR I/O cells.

CPI packet protocols (point-to-point and routable) may use an AIB channel in either SDR or DDR operation modes. In some example embodiments, the AIB channel shall be is in increments of 80 I/O cells (i.e. 40 TX and 40 RX) for SDR mode and 40 I/O cells for DDR mode.

CPI streaming protocol may use an AIB channel in either SDR or DDR operation modes. In some example embodiments, for both modes (SDR and DDR) the AIB channel is in increments of 40 I/O cells.

Each AIB channel is assigned a unique interface identifier. The identifier is used during CPI reset and initialization to determine paired AIB channels across adjacent chiplets. In some example embodiments, the interface identifier is a 20-bit value comprising a seven-bit chiplet identifier, a seven-bit column identifier, and a six-bit link identifier. The AIB physical layer transmits the interface identifier using an AIB out-of-band shift register. The 20-bit interface identifier is transferred in both directions across an AIB interface using bits 32-51 of the shift registers.

In some example embodiments, AIB channels are numbered in continuous increasing order starting with the AIB channel adjacent to the AUX channel. The AIB channel adjacent to the AUX is defined to be AIB channel zero.

FIG. 3, by way of example, shows eight chiplets 310 connected by a network comprising eight nodes 330. More or fewer chiplets 310 and more or fewer nodes 330 may be included in the chiplet network, allowing a network of chiplets of arbitrary size to be created.

FIG. 4 is a block diagram of a packet buffer 400 that uses credit-based flow control and a packet command buffer 450 suitable for use in early credit return in a system using credit-based flow control, in accordance with some embodiments of the present disclosure.

The packet buffer 400 comprises entries 405, 410, 415, 420, 425, and 430. The packet command buffer 450 comprises entries 455, 460, 465, 470, 475, and 480. The packet buffer 400 and the packet command buffer 450 are controlled by a buffer control unit. The buffer control unit maintains the packet buffer 400 and the packet command buffer 450, transfers data from the packet buffer 400 and the packet command buffer 450 to the packet decoder 230, causes credit return packets to be added to the network output queues 245 via the packet encoder 240, or any suitable combination thereof. The buffer control unit may be implemented as hardware within the network interface 225.

Each of the entries 405-430 contains four slots, each of which can hold one piece of access command data (e.g., a memory read command, a memory write command, a built-in atomic command, or a custom atomic command). FIG. 4 illustrates an example of packets stored in the packet buffer 400 and the packet command buffer 450. Three slots of the entry 405 hold data received in a first packet, T0. The remaining slot of the entry 405 and all four slots of the entry 410 hold data received in a second packet, T2. Three slots of the entry 415 hold data received in a third packet, T3; the remaining slot of the entry 415 holds data received in a fourth packet, T4. The entries 420-430 are empty and available store data received in future packets.

Before sending the data packet T0, the sending device decrements its available credits by one, since all three memory access command packet pieces of data could fit in a single four-slot entry. Once all the slots in the entry 405 are processed, the receiving device marks the entry 405 as available and returns a credit to the sending device.

Before sending the memory access command packet T2, the sending device decremented its available credits by two, since the five T2 pieces of data do not fit in a single entry but do fit in two four-slot entries. In systems not using early credit return, the T2 pieces of data are stored in two entries (e.g., the entries 410 and 415) and two credits are returned when the two entries are processed. Alternatively, the T2 pieces of data are stored as shown in FIG. 4 and the number of credits returned is calculated based a combination of the total the number of entries used and the processing of those entries. Thus, two credits would be returned for the five T2 data packets even though only one additional entry (the entry 410) is used to store the T2 data packets.

In systems using early credit return, the slot of the entry 405 not storing T0 data is used to store the first piece of the T2 data. Thus, the remaining four pieces of data are stored in the additional entry 410. As a result of packing data from two different packets in the entry 405, the T2 data only consumes one additional entry. The receiving system determines, based on the number of pieces of data in the T2 packet and the number of slots in each entry, that the sending system spent two credits. Since two credits were spent but only one entry was used by adding the T2 data, the receiving system can return one credit before the T2 data is processed.

Similarly, the sending system spent one credit in sending the T4 data but, since no additional entries were used by the T4 data, the credit can be returned by the receiving system before the T4 data is processed.

The packet command buffer 450 stores one entry for each packet represented in the packet buffer 400. The entry 455 stores the T0 header, a pointer to the slot containing the first portion of the T0 data, and a length of the T0 data. The pointer indicates both the entry 405 and the offset (0) within the entry 405. In the example of FIG. 4, each of the entries 405-430 of the packet buffer 400 has four slots. Accordingly, the offset value in the packet command buffer 450 may be stored in two bits. In some example embodiments, the entry and the offset are packed into a single byte (e.g., using a 6-bit entry identifier and a 2-bit offset value), word, or double-word.

The entry 460 stores the T2 header, the corresponding entry and offset in the packet buffer 400, and the amount of T2 data in the packet buffer 400. The entries 465 and 470 store data for the T3 and T4 packets respectively. The entries 475 and 480 are available to store data for additional incoming packets.

FIG. 5 is a block diagram of a data packet 500 suitable for use in a system using credit-based flow control, in accordance with some embodiments of the present disclosure. The data packet 500 is divided into flow control units (flits), each of which is composed of 36 bits. The first flit of the data packet 500 includes CP field 505, path field 510, stat field 515, destination identifier (DID) field 520, sequence continue (SC) field 525, length field 530, and command field 535. Each remaining flit includes a credit return (CR)/write enable mask (WEM) field (e.g., the CR/WEM fields 540 and 550) and a data field (e.g., the data fields 545 and 555).

The CP field 505 is a two-bit field that indicates whether the CR/WEM field of later flits in the packet contain CR data. WEM data, or should be ignored, and whether the path field 510 should be used to control ordering of packets. In some example embodiments, a value of 0 or 1 in the CP field 505 indicates that the CR/WEM fields 540, 550 contain credit return data; a value of 2 or 3 in the CP field 505 indicates that the CR/WEM fields 540, 550 contain WEM data; a value of 0 indicates that the path field 510 is ignored; a value of 1 or 3 indicates that the path field 510 is used to determine the path for the data packet 500; and a value of 2 indicates that single path ordering is to be used.

The path field 510 is an eight-bit field. When the CP field 505 indicates that the path field 510 is used to determine the path for a data packet 500, all data packets having the same value for the path field 510 are guaranteed to take the same path through the network. As a result, the order of the data packets will be unchanged between the sender and the receiver. If the CP field 505 indicates that single path ordering is to be used, the path is determined for each packet as though the path field 510 were set to zero. Accordingly, all packets take the same path and the order will be unchanged, regardless of the actual value of the path field 510 of each data packet. If the CP field 505 indicates that the path field 510 is to be ignored, the data packets are routed without regard to the value of the path field 510 and the data packets may be received by the receiver in a different order than they were sent by the sender. However, this may avoid congestion in the network and allow for greater throughput in the device.

The response status is stored in the stat field 515, a four-bit field. In some example embodiments, a status of zero indicates that a request was successfully handled and non-zero statuses indicate various error codes.

The DID field 520 stores a twelve-bit DID. The DID uniquely identifies a destination in the network (e.g., a destination chiplet). A sequence of data packets all having the SC field 525 set are guaranteed to be delivered in order. The length field 530 is a five-bit field that indicates the number of flits that comprise the data packet 500. Interpretation of the length field 530 may be non-linear. For example, values 0-22 may be interpreted as 0-22 flits in the data packet 500 and values 23-27 may be interpreted as 33-37 flits in the data packet 500 (i.e., 10 more than the indicated value). Other values of the length field 530 may be vendor defined instead of protocol defined.

The command for the data packet 500 is stored in the command field 535, a seven-bit field. The command may be a write command, a read command, a predefined atomic operation command, a custom atomic operation command, a read response, an acknowledge response, or a vendor-specific command. Additionally, the command may indicate a virtual channel of the data packet 500. For example, different commands may be used for different virtual channels or 1, 2, 3, or 4 bits of the seven-bit command field 535 may be used to indicate the virtual channel and the remaining bits may be used to indicate the command.

The memory access commands may further identify a number of bytes to be written or accessed, a memory space to access (e.g., the off-die memory 375 or an instruction memory for custom atomic operations), or any suitable combination thereof. In some example embodiments, the command may indicate that additional bits of a later flit identify the command. For example, a multi-byte command could be sent by using a vendor-specific command in the seven-bit command field 535 and using a portion or all of the 32-bit data field 545 to contain the larger command.

If WEM is enabled, the CR/WEM field 540, 550 is a four-bit mask that indicates if each of the corresponding bytes of the 32 bits of data in the flit is to be written. Thus, a single flit is always 36 bits in size, but may contain 0-32 bits of data to be written. If CR is enabled, two bits of the CR/WEM field 540, 550 identify whether the credit return is for virtual channel 0, 1, 2, or 3 and the other two bits of the CR/WEM field 540, 550 indicate whether the number of credits to be returned is 0, 1, 2, or 3.

FIG. 6 is a block diagram of a data packet 600 suitable for early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure. The data packet 600 comprises a single 36-bit flit. The flit includes four credit return fields 605, 610, 615, and 620, a length field 630, and reserved fields 625 and 635. The length field 630 is set to zero, to indicate that no additional flits make up the data packet 600. The reserved fields 625 and 635 are not used and should be set to zero.

Each of the credit return fields 605-620 is a five-bit field. The first bit of a credit return field 605-620 is set to zero if the credits are being returned to a low virtual channel. The first bit of a credit return field 605-620 is set to one if the credits are being returned to a high virtual channel. The remaining four bits of each credit return field 605-620 indicate the number of credits (0-15) being returned. Thus, the CR0 credit return field 620 returns 0-15 credits to virtual channel 0 or 4; the CR1 credit return field 615 returns 0-15 credits to virtual channel 1 or 5; the CR2 credit return field 610 returns 0-15 credits to virtual channel 2 or 6; and the CR3 credit return field 605 returns 0-15 credits to virtual channel 3 or 7.

Thus, early credit return for credit-based flow control can be implemented by using the CR/WEM field 540, 550 of the data packet 500 when sending other data packets, such as acknowledgement packets or by using the data packet 600.

FIG. 7 is a flow chart showing operations of a method 700 performed by two circuits in performing early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure. The method 700 includes operations 710, 720, 730, 740, and 750. By way of example and not limitation, the method 700 is described as being performed by the devices of FIGS. 1-3, using the buffer of FIG. 4 and the data packets 500, 600 of FIGS. 5-6.

In operation 710, a first circuit sends, to a second circuit, a first packet indicating a number of credits available for the second circuit. In some example embodiments, operation 710 is performed during initialization of the first circuit. The first packet may be a data packet 600, returning credits on one or more virtual channels to the second circuit.

The second circuit, in operation 720, sends a second packet to the first circuit, the second packet comprising flits corresponding to a partial credit. For example, the first circuit may send a packet 500 in which there is a header flit and one data flit. In an example embodiment in which a flit corresponds to one slot in the packet buffer 400, the packet to be written corresponds to only a partial credit, since the packet having only two flits is less than the four slots in an entry of the packet buffer 400.

In operation 730, based on the data corresponding to a partial credit, the second circuit decrements available credits by a full credit. For example, the second circuit may track available credits for multiple virtual channels and decrement the available credits for the virtual channel on which the second packet was sent, based on the number of flits as indicated by the value in the length field 530.

As another example, a data packet 500 is sent (in operation 720) that comprises multiple flits and multiple credits are spent (in operation 730), the multiple credits corresponding to the multiple flits.

The first circuit, in operation 740, receives the data and stores the data in a buffer. For example, the T4 data in the packet buffer 400 may be stored in the entry 415, as shown in FIG. 4.

Based on alignment of the received flits in the buffer causing the flits to not use a new entry in the buffer, the first circuit sends a third packet to the second circuit, returning a credit to the second circuit (operation 750). For example, since the entry 415 had one available slot and the T4 data only consumed one slot, the T4 data was stored in the packet buffer 400 without consuming an additional entry in the packet buffer 400. Accordingly, the first circuit sends a packet that returns a credit to the second circuit. For example, a data packet 500 may be sent with a command field 535 that indicates the virtual channel of the packet T4 and an acknowledgement of the command of the packet T4; a value in the CP field 505 that indicates that the CR/WEM field 540 contains credit return data; and a value of one in the CR/WEM field 540.

Had the entry 415 been full, the T4 data would have been stored in a new entry and an acknowledgement of the T4 command would be sent without an early credit return. Likewise, the T3 data, received prior to the T4 data, was stored in the entry 415 without causing the first circuit to transmit a packet comprising a credit return. Even though the T3 data consumes less than a full entry, storing the T3 data made use of the entry 415 which was, at that time, empty. Accordingly, a credit was properly spent by the sending device. Thus, in some example embodiments, a first packet comprising one flit would properly consume a credit while a second packet comprising more commands (e.g., three flits) would result in a credit being returned early.

As another example application of the method 700, the T2 data shown in FIG. 4 may have been received, wherein a first flit of the T2 data is stored in the entry 405 and additional commands are stored in (what was then) an unused entry of the packet buffer 400. As a result, the T2 data used one new entry of the packet buffer 400 instead of two and one credit is immediately returned to the sender. In this example, the count of the plurality of flits of the T2 data is five, which exceeds the number of entries in each entry of the packet buffer 400. Thus, a credit may be returned both in the case in which the number of flits in the packet is less than the number of slots in entries (e.g., as in the T4 data of the entry 415) or greater than the number of slots in entries (e.g., as in the T2 data of the entries 405 and 410). However, regardless of the alignment of the buffer, no credit will be returned when the number of flits is an even multiple of the size of the buffer entries, since a whole number of entries will always be consumed.

In this example, the T2 data fit in two entries. In other example embodiments, a data packet may span more than two entries.

FIG. 8 is a flow chart showing operations of an example method 800 performed by two circuits in performing early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure. The method 800 is an option extension of the method 700 and includes operations 810 and 820. By way of example and not limitation, the method 800 is described as being performed by the devices of FIGS. 1-3, using the buffer of FIG. 4 and the packets 500, 600 of FIGS. 5-6.

After performing the method 700 as described above with respect to FIG. 7, the second circuit, based on receiving the third packet, increments the available credits (operation 810). In operation 820, based on the incremented available credits, the second circuit sends, to the first circuit, a fourth packet. For example, after decrementing the available credits in operation 730, insufficient credits are available to send the fourth packet but, after receiving the returned credit, sufficient credits are available. As a result, the fourth packet is sent once the credit return packet is received, without waiting for the first device to process data stored in the packet buffer 400.

FIG. 9 is a flow chart showing operations of a method 900 performed by a circuit in performing early return of credits in a system using credit-based flow control, in accordance with some embodiments of the present disclosure. The method 900 includes operations 910 and 920. By way of example and not limitation, the method 900 is described as being performed by the devices of FIGS. 1-3, using the buffer of FIG. 4 and the data packets 500, 600 of FIGS. 5-6.

In operation 910, a chiplet receives, from a source (e.g., another chiplet or a host of the PCIe card 100), a packet comprising a first command. For example, the T4 data in the packet buffer 400 may be stored in the entry 415, as shown in FIG. 4.

Based on an entry of a packet buffer 400 already containing a second packet and having an available entry alignment of the received data in the packet buffer 400, causing the data to not use a new entry in the packet buffer 400, the chiplet stores the first packet in the available entry and transmits, to the source, a packet comprising a credit return that indicates available space in the buffer for the source (operation 920). For example, since the entry 415 had one available slot and the T4 data only consumed one slot, the T4 data was stored in the packet buffer 400 without consuming an additional entry in the packet buffer 400. Accordingly, the chiplet sends a packet that returns a credit to the source. For example, a data packet 500 may be sent with a command field that indicates the virtual channel of the packet T4 and an acknowledgement of the command of the packet T4; a value in the CP field 505 that indicates that the CR/WEM field 540 contains credit return data; and a value of one in the CR/WEM field 540.

FIG. 10 illustrates a block diagram of an example machine 1000 with which, in which, or by which any one or more of the techniques (e.g., methodologies) discussed herein can be implemented. Examples, as described herein, can include, or can operate by, logic or a number of components, or mechanisms in the machine 1000. Circuitry (e.g., processing circuitry) is a collection of circuits implemented in tangible entities of the machine 1000 that include hardware (e.g., simple circuits, gates, logic, etc.). Circuitry membership can be flexible over time. Circuitries include members that can, alone or in combination, perform specified operations when operating. In an example, hardware of the circuitry can be immutably designed to carry out a specific operation (e.g., hardwired). In an example, the hardware of the circuitry can include variably connected physical components (e.g., execution units, transistors, simple circuits, etc.) including a machine readable medium physically modified (e.g., magnetically, electrically, moveable placement of invariant massed particles, etc.) to encode instructions of the specific operation. In connecting the physical components, the underlying electrical properties of a hardware constituent are changed, for example, from an insulator to a conductor or vice versa. The instructions enable embedded hardware (e.g., the execution units or a loading mechanism) to create members of the circuitry in hardware via the variable connections to carry out portions of the specific operation when in operation. Accordingly, in an example, the machine readable medium elements are part of the circuitry or are communicatively coupled to the other components of the circuitry when the device is operating. In an example, any of the physical components can be used in more than one member of more than one circuitry. For example, under operation, execution units can be used in a first circuit of a first circuitry at one point in time and reused by a second circuit in the first circuitry, or by a third circuit in a second circuitry at a different time. Additional examples of these components with respect to the machine 1000 follow.

In alternative embodiments, the machine 1000 can operate as a standalone device or can be connected (e.g., networked) to other machines. In a networked deployment, the machine 1000 can operate in the capacity of a server machine, a client machine, or both in server-client network environments. In an example, the machine 1000 can act as a peer machine in peer-to-peer (P2P) (or other distributed) network environment. The machine 1000 can be a personal computer (PC), a tablet PC, a set-top box (STB), a personal digital assistant (PDA), a mobile telephone, a web appliance, a network router, switch or bridge, or any machine capable of executing instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein, such as cloud computing, software as a service (SaaS), other computer cluster configurations.

The machine (e.g., computer system) 1000 can include a hardware processor 1002 (e.g., a central processing unit (CPU), a graphics processing unit (GPU), a hardware processor core, or any combination thereof), a main memory 1004, a static memory (e.g., memory or storage for firmware, microcode, a basic-input-output (BIOS), unified extensible firmware interface (UEFI), etc.) 1006, and mass storage 1008 (e.g., hard drives, tape drives, flash storage, or other block devices) some or all of which can communicate with each other via an interlink (e.g., bus) 1030. The machine 1000 can further include a display unit 1010, an alphanumeric input device 1012 (e.g., a keyboard), and a user interface (UI) navigation device 1014 (e.g., a mouse). In an example, the display unit 1010, input device 1012 and UI navigation device 1014 can be a touch screen display. The machine 1000 can additionally include a storage device (e.g., drive unit) 1008, a signal generation device 1018 (e.g., a speaker), a network interface device 1020, and one or more sensors 1016, such as a global positioning system (GPS) sensor, compass, accelerometer, or other sensor. The machine 1000 can include an output controller 1028, such as a serial (e.g., universal serial bus (USB), parallel, or other wired or wireless (e.g., infrared (IR), near field communication (NFC), etc.) connection to communicate or control one or more peripheral devices (e.g., a printer, card reader, etc.).

Registers of the processor 1002, the main memory 1004, the static memory 1006, or the mass storage 1008 can be, or include, a machine readable medium 1022 on which is stored one or more sets of data structures or instructions 1024 (e.g., software) embodying or utilized by any one or more of the techniques or functions described herein. The instructions 1024 can also reside, completely or at least partially, within any of registers of the processor 1002, the main memory 1004, the static memory 1006, or the mass storage 1008 during execution thereof by the machine 1000. In an example, one or any combination of the hardware processor 1002, the main memory 1004, the static memory 1006, or the mass storage 1008 can constitute the machine readable media 1022. While the machine readable medium 1022 is illustrated as a single medium, the term “machine readable medium” can include a single medium or multiple media (e.g., a centralized or distributed database, or associated caches and servers) configured to store the one or more instructions 1024.

The term “machine readable medium” can include any medium that is capable of storing, encoding, or carrying instructions for execution by the machine 1000 and that cause the machine 1000 to perform any one or more of the techniques of the present disclosure, or that is capable of storing, encoding or carrying data structures used by or associated with such instructions. Non-limiting machine readable medium examples can include solid-state memories, optical media, magnetic media, and signals (e.g., radio frequency signals, other photon based signals, sound signals, etc.). In an example, a non-transitory machine readable medium comprises a machine readable medium with a plurality of particles having invariant (e.g., rest) mass, and thus are compositions of matter. Accordingly, non-transitory machine-readable media are machine readable media that do not include transitory propagating signals. Specific examples of non-transitory machine readable media can include: non-volatile memory, such as semiconductor memory devices (e.g., electrically programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM)) and flash memory devices; magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.

In an example, information stored or otherwise provided on the machine readable medium 1022 can be representative of the instructions 1024, such as instructions 1024 themselves or a format from which the instructions 1024 can be derived. This format from which the instructions 1024 can be derived can include source code, encoded instructions (e.g., in compressed or encrypted form), packaged instructions (e.g., split into multiple packages), or the like. The information representative of the instructions 1024 in the machine readable medium 1022 can be processed by processing circuitry into the instructions to implement any of the operations discussed herein. For example, deriving the instructions 1024 from the information (e.g., processing by the processing circuitry) can include: compiling (e.g., from source code, object code, etc.), interpreting, loading, organizing (e.g., dynamically or statically linking), encoding, decoding, encrypting, unencrypting, packaging, unpackaging, or otherwise manipulating the information into the instructions 1024.

In an example, the derivation of the instructions 1024 can include assembly, compilation, or interpretation of the information (e.g., by the processing circuitry) to create the instructions 1024 from some intermediate or preprocessed format provided by the machine readable medium 1022. The information, when provided in multiple parts, can be combined, unpacked, and modified to create the instructions 1024. For example, the information can be in multiple compressed source code packages (or object code, or binary executable code, etc.) on one or several remote servers. The source code packages can be encrypted when in transit over a network and decrypted, uncompressed, assembled (e.g., linked) if necessary, and compiled or interpreted (e.g., into a library, stand-alone executable etc.) at a local machine, and executed by the local machine.

The instructions 1024 can be further transmitted or received over a communications network 1026 using a transmission medium via the network interface device 1020 utilizing any one of a number of transfer protocols (e.g., frame relay, internet protocol (IP), transmission control protocol (TCP), user datagram protocol (UDP), hypertext transfer protocol (HTTP), etc.). Example communication networks can include a local area network (LAN), a wide area network (WAN), a packet data network (e.g., the Internet), mobile telephone networks (e.g., cellular networks), plain old telephone (POTS) networks, and wireless data networks (e.g., Institute of Electrical and Electronics Engineers (IEEE) 802.11 family of standards known as Wi-Fi®. IEEE 802.16 family of standards known as WiMax®). IEEE 802.15.4 family of standards, peer-to-peer (P2P) networks, among others. In an example, the network interface device 1020 can include one or more physical jacks (e.g., Ethernet, coaxial, or phone jacks) or one or more antennas to connect to the communications network 1026. In an example, the network interface device 1020 can include a plurality of antennas to wirelessly communicate using at least one of single-input multiple-output (SIMO), multiple-input multiple-output (MIMO), or multiple-input single-output (MISO) techniques. The term “transmission medium” shall be taken to include any intangible medium that is capable of storing, encoding or carrying instructions for execution by the machine 1000, and includes digital or analog communications signals or other intangible medium to facilitate communication of such software. A transmission medium is a machine readable medium.

In the foregoing specification, some example implementations of the disclosure have been described. It will be evident that various modifications can be made thereto without departing from the broader scope and spirit of the disclosure as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than in a restrictive sense. Below is a non-exhaustive list of examples of implementations of the present disclosure.

Example 1 is a system comprising: a hardware transceiver configured to perform operations comprising: receiving, from a source, a packet comprising a first command; a buffer control unit configured to control a buffer and perform operations comprising: based on a entry of the buffer that already contains a second command having an available entry: storing the first command in the available entry; and causing the hardware transceiver to transmit, to the source, a packet comprising a credit return that indicates buffer space available for the source.

In Example 2, the subject matter of Example 1 includes, wherein: the packet comprises a plurality of commands comprising the first command and additional commands; and the operations of the buffer control unit further comprise: storing the additional commands in an unused entry of the buffer.

In Example 3, the subject matter of Example 2 includes, wherein: a count of the plurality of commands exceeds a number of entries in each entry of the buffer.

In Example 4, the subject matter of Examples 1-3 includes, wherein: the first command is a memory access command.

In Example 5, the subject matter of Examples 1-4 includes, wherein: the first command is a memory write command.

In Example 6, the subject matter of Examples 1-5 includes, wherein: the hardware transceiver and the buffer control unit are parts of a first chiplet; and the source is a second chiplet.

In Example 7, the subject matter of Examples 1-6 includes, wherein: the operations of the hardware transceiver further comprise: prior to receiving the packet, receiving a prior packet comprising one or more prior commands including the second command, a count of the prior commands being less than a width of the entry of the buffer, the entry of the buffer being empty at the time of receiving the prior packet; and the operations of the buffer control unit further comprise: storing the prior commands in the entry of the buffer without causing the hardware transceiver to transmit a packet comprising a credit return.

Example 8 is a method comprising: receiving, from a source, a packet comprising a first memory command; based on a entry of a buffer that already contains a second memory command having an available entry: storing the first command in the available entry; and transmitting, to the source, a packet comprising a credit return that indicates buffer space available for the source.

In Example 9, the subject matter of Example 8 includes, wherein: the packet comprises a plurality of commands comprising the first memory command and additional commands; and the method further comprises: storing the additional commands in an unused entry of the buffer.

In Example 10, the subject matter of Example 9 includes, wherein: a count of the plurality of commands exceeds a number of entries in each entry of the buffer.

In Example 11, the subject matter of Examples 8-10 includes, wherein: the first memory command is a memory access command.

In Example 12, the subject matter of Examples 8-11 includes, wherein: the first memory command is a memory write command.

In Example 13, the subject matter of Examples 8-12 includes, wherein: the receiving is performed by a first chiplet; and the source is a second chiplet.

In Example 14, the subject matter of Examples 8-13 includes, prior to receiving the packet, receiving a prior packet comprising one or more prior commands including the second command, a count of the prior commands being less than a width of the entry of the buffer, the entry of the buffer being empty at the time of receiving the prior packet; and storing the prior commands in the entry of the buffer without transmitting a packet comprising a credit return.

Example 15 is a non-transitory machine-readable medium that stores instructions that, when executed by a system, cause the system to perform operations comprising: receiving, from a source, a packet comprising a first command; based on a entry of a buffer that already contains a second command having an available entry: storing the first command in the available entry; and transmitting, to the source, a packet comprising a credit return that indicates buffer space available for the source.

In Example 16, the subject matter of Example 15 includes, wherein: the packet comprises a plurality of commands comprising the first command and additional commands; and the method further comprises: storing the additional commands in an unused entry of the buffer.

In Example 17, the subject matter of Example 16 includes, wherein: a count of the plurality of commands exceeds a number of entries in each entry of the buffer.

In Example 18, the subject matter of Examples 15-17 includes, wherein: the first command is a memory access command.

In Example 19, the subject matter of Examples 15-18 includes, wherein: the first command is a memory write command.

In Example 20, the subject matter of Examples 15-19 includes, wherein: the receiving is performed by a first chiplet; and the source is a second chiplet.

Example 21 is at least one machine-readable medium including instructions that, when executed by processing circuitry, cause the processing circuitry to perform operations to implement of any of Examples 1-20.

Example 22 is an apparatus comprising means to implement of any of Examples 1-20.

Example 23 is a system to implement of any of Examples 1-20.

Example 24 is a method to implement of any of Examples 1-20. 

What is claimed is:
 1. A system comprising: a hardware transceiver configured to perform operations comprising: receiving, from a source, a packet comprising a first command; a buffer control unit configured to control a buffer and perform operations comprising: based on a entry of the buffer that already contains a second command having an available entry: storing the first command in the available entry; and causing the hardware transceiver to transmit, to the source, a packet comprising a credit return that indicates buffer space available for the source.
 2. The system of claim 1, wherein: the packet comprises a plurality of commands comprising the first command and additional commands; and the operations of the buffer control unit further comprise: storing the additional commands in an unused entry of the buffer.
 3. The system of claim 2, wherein: a count of the plurality of commands exceeds a number of entries in each entry of the buffer.
 4. The system of claim 1, wherein: the first command is a memory access command.
 5. The system of claim 1, wherein: the first command is a memory write command.
 6. The system of claim 1, wherein: the hardware transceiver and the buffer control unit are parts of a first chiplet; and the source is a second chiplet.
 7. The system of claim 1, wherein: the operations of the hardware transceiver further comprise: prior to receiving the packet, receiving a prior packet comprising one or more prior commands including the second command, a count of the prior commands being less than a width of the entry of the buffer, the entry of the buffer being empty at the time of receiving the prior packet; and the operations of the buffer control unit further comprise: storing the prior commands in the entry of the buffer without causing the hardware transceiver to transmit a packet comprising a credit return.
 8. A method comprising: receiving, from a source, a packet comprising a first memory command; based on a entry of a buffer that already contains a second memory command having an available entry; storing the first command in the available entry; and transmitting, to the source, a packet comprising a credit return that indicates buffer space available for the source.
 9. The method of claim 8, wherein: the packet comprises a plurality of commands comprising the first memory command and additional commands; and the method further comprises: storing the additional commands in an unused entry of the buffer.
 10. The method of claim 9, wherein: a count of the plurality of commands exceeds a number of entries in each entry of the buffer.
 11. The method of claim 8, wherein: the first memory command is a memory access command.
 12. The method of claim 8, wherein: the first memory command is a memory write command.
 13. The method of claim 8, wherein: the receiving is performed by a first chiplet; and the source is a second chiplet.
 14. The method of claim 8, further comprising: prior to receiving the packet, receiving a prior packet comprising one or more prior commands including the second command, a count of the prior commands being less than a width of the entry of the buffer, the entry of the buffer being empty at the time of receiving the prior packet; and storing the prior commands in the entry of the buffer without transmitting a packet comprising a credit return.
 15. A non-transitory machine-readable medium that stores instructions that, when executed by a system, cause the system to perform operations comprising: receiving, from a source, a packet comprising a first command; based on a entry of a buffer that already contains a second command having an available entry: storing the first command in the available entry; and transmitting, to the source, a packet comprising a credit return that indicates buffer space available for the source.
 16. The non-transitory machine-readable medium of claim 15, wherein: the packet comprises a plurality of commands comprising the first command and additional commands; and the method further comprises: storing the additional commands in an unused entry of the buffer.
 17. The non-transitory machine-readable medium of claim 16, wherein: a count of the plurality of commands exceeds a number of entries in each entry of the buffer.
 18. The non-transitory machine-readable medium of claim 15, wherein: the first command is a memory access command.
 19. The non-transitory machine-readable medium of claim 15, wherein: the first command is a memory write command.
 20. The non-transitory machine-readable medium of claim 15, wherein: the receiving is performed by a first chiplet; and the source is a second chiplet. 